Synthesis of Composition and Discrimination Operators for Divide-and-Conquer Logic Programs
نویسندگان
چکیده
This chapter gives a brief overview of our framework for stepwise synthesis of logic programs from examples and properties. Directives are extracted for the development of a particular synthesis mechanism whose steps are guided by a divide-and-conquer schema. It features deductive and inductive reasoning. Examples and properties are presented to it in a non-incremental fashion. The objectives and methods of its last steps (synthesis of composition and discrimination operators) are formalized, and illustrated on some sample problems. This chapter is organized as follows. After the introduction, three sample problems are presented in section 1.2. Sections 1.3 to 1.5 present the objectives and methods of some synthesis steps, and illustrate them on the sample problems. Some conclusions on the results are drawn in section 1.6, related work is stated, and future research directions are outlined.
منابع مشابه
Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملCovering vs. Divide-and-Conquer for Top-Down Induction of Logic Programs
Covering and divide-and-conquer are two wellestablished search techniques for top-down in duction of propositional theories However, for top-down induction of logic programs, only covering has been formalized and used extensively In this work, the divide-and-conquer technique is formalized as well and compared to the covering technique in a logic program ming framework Covering works by repea...
متن کاملTowards Stepwise, Schema-Guided Synthesis of Logic Programs
We present a general strategy for stepwise, sound and progressive synthesis of logic programs from specifications by examples and properties. We particularize this to schema-guided synthesis, and state a generic synthesis theorem. We justify some design choices for the development of a particular synthesis mechanism that is guided by a Divide-and-Conquer schema, is inductive and deductive, is i...
متن کاملInduction of Logic Programs by Example-Guided Unfolding
Resolution has been used as a specialisation operator in several approaches to top-down induction of logic programs. This operator allows the overly general hypothesis to be used as a declarative bias that restricts not only what predicate symbols can be used in produced hypotheses, but also how the predicates can be invoked. The two main strategies for top-down induction of logic programs, Cov...
متن کاملA Divide and Conquer Strategy for Hazard Free 2–Level Logic Synthesis
In this paper we propose a divide and conquer strategy for the calculation of hazard free prime implicants. It is capable of calculating all hazard free prime implicants but it can be restricted to calculate only those primes that can possibly contribute to a solution. We show that this significantly reduces the number of generated primes, and thus reduces the runtime of the exact minimization ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991